Accelerated Bend Minimization
نویسندگان
چکیده
We present an O(n) algorithm for minimizing the number of bends in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of O(n7/4√logn) shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapacitated min-cost flow problem on a planar bidirected graph with bounded costs and face sizes in O(n) time. Submitted: October 2011 Reviewed: February 2012 Revised: February 2012 Accepted: April 2012 Final: April 2012 Published: Article type: Regular paper Communicated by: M. van Kreveld and B. Speckmann Andreas Karrenbauer is supported by the Zukunftskolleg of the University of Konstanz. E-mail addresses: [email protected] (Sabine Cornelsen) Andreas.Karrenbauer@ uni-konstanz.de (Andreas Karrenbauer) JGAA, 0(0) 0–0 (0) 1
منابع مشابه
The graphs that can be drawn with one bend per edge
We provide a precise description of the class of graphs that admit a one-bend drawing, i.e., an orthogonal drawing with at most one bend per edge. The main tools for the proof are Eulerian orientations of graphs and discrete harmonic functions. Mathematics Subject Classi cations (2010) 05C62,
متن کاملUniversal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.
متن کاملUniversal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.
متن کاملMinimizing Dispersion in a TEM Waveguide Bend by a Layered Approximation of a Graded Dielectric Material
Waveguide bends pose a problem for high-voltage uh.ra-wideband (UWB) systems or for any tr.ansmission-line system with low-loss/fast-risetime requirements, since only a straight section of conventional transmission line can support the pure TEM mode necessary to preserve the risetime of a transmitted pulse. Here we consider alternative concepts for compensation of waveguide bends. One concept, ...
متن کاملHigher-Degree Orthogonal Graph Drawing with Flexibility Constraints
Much work on orthogonal graph drawing has focused on 4-planar graphs, that is planar graphs where all vertices have maximum degree 4. In this work, we study aspects of the Kandinsky model, which is a model for orthogonal graph drawings of higher-degree graphs. First, we examine the decision problem β-Embeddability, which asks whether for a given planar graph with a fixed or variable embedding, ...
متن کامل